منابع مشابه
On $m$-Closed Graphs
A graph is closed when its vertices have a labeling by [n] such that the binomial edge ideal JG has a quadratic Gröbner basis with respect to the lexicographic order induced by x1 > · · · > xn > y1 > · · · > yn. In this paper, we generalize this notion and study the so called m-closed graphs. We find equivalent condition to 3-closed property of an arbitrary tree T . Using it, we classify a clas...
متن کاملOn closed graphs, II
A graph is closed when its vertices have a labeling by [n] with a certain property first discovered in the study of binomial edge ideals. In this article, we explore various aspects of closed graphs, including the number of closed labelings and clustering coefficients.
متن کاملClosed orders and closed graphs
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
متن کاملOn the Characterization of Closed, Left-Reversible, Closed Graphs
Let us assume there exists a Hippocrates and Jordan conditionally Perelman, almost hyper-meromorphic, solvable morphism. Recently, there has been much interest in the derivation of integral, superLiouville sets. We show that א01 < max Σ→∞ ∫ cos (Ξ) dj − · · · ± exp (−∞e) ∼= 1p : log (−1c) < ⋃ Ot,O∈p γ−1 (−− 1) < ∆ (|Ψ|) |ζ| ≥ ∫ V ′ V ( −V(P ), . . . ,−U (λ) ) dx̄. It is essential to conside...
متن کاملOn H-Linked Graphs
For a fixed multigraph H , possibly containing loops, with V (H) = {h1, . . . , hk}, we say a graph G is H -linked if for every choice of k vertices v1, . . . , vk in G, there exists a subdivision of H in G such that vi represents hi (for all i). This notion clearly generalizes the concept of k-linked graphs (as well as other properties). In this paper we determine, for a connected multigraph H...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 1988
ISSN: 0011-4642,1572-9141
DOI: 10.21136/cmj.1988.102236